By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 7, Issue 2, pp. 295-578

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On the Self-Concordance of the Universal Barrier Function

Osman Güler

pp. 295-303

BibTeX  Abstract Full Text:  PDF

A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity

Rongqin Sheng and Florian A. Potra

pp. 304-317

BibTeX  Abstract Full Text:  PDF

A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP

Florian A. Potra and Rongqin Sheng

pp. 318-335

BibTeX  Abstract Full Text:  PDF

Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization

Krzysztof C. Kiwiel

pp. 336-346

BibTeX  Abstract Full Text:  PDF

Penalty/Barrier Multiplier Methods for Convex Programming Problems

Aharon Ben-Tal and Michael Zibulevsky

pp. 347-366

BibTeX  Abstract Full Text:  PDF

Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries

Claude Lemaréchal and Claudia Sagastizábal

pp. 367-385

BibTeX  Abstract Full Text:  PDF

An Infeasible Path-Following Method for Monotone Complementarity Problems

Paul Tseng

pp. 386-402

BibTeX  Abstract Full Text:  PDF

Smooth Approximations to Nonlinear Complementarity Problems

Bintong Chen and Patrick T. Harker

pp. 403-420

BibTeX  Abstract Full Text:  PDF

Convergence Rates in Forward--Backward Splitting

George H-G. Chen and R. T. Rockafellar

pp. 421-444

BibTeX  Abstract Full Text:  PDF

Convergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses

Xiaojun Chen, Zuhair Nashed, and Liqun Qi

pp. 445-462

BibTeX  Abstract Full Text:  PDF

Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems

Defeng Sun and Jiye Han

pp. 463-480

BibTeX  Abstract Full Text:  PDF

Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems

J. J. Ye, D. L. Zhu, and Q. J. Zhu

pp. 481-507

BibTeX  Abstract Full Text:  PDF

On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints

Alexander Shapiro

pp. 508-518

BibTeX  Abstract Full Text:  PDF

Hadamard and Strong Well-Posedness for Convex Programs

Julian P. Revalski

pp. 519-526

BibTeX  Abstract Full Text:  PDF

A Projection-Based Algorithm for Consistent and Inconsistent Constraints

Tuvia Kotzer, Nir Cohen, and Joseph Shamir

pp. 527-546

BibTeX  Abstract Full Text:  PDF

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties

T. C. Edwin Cheng, Mikhail Y. Kovalyov, and Bertrand M. T. Lin

pp. 547-559

BibTeX  Abstract Full Text:  PDF

A Network Design Problem for a Distribution System with Uncertain Demands

Franco Blanchini, Franca Rinaldi, and Walter Ukovich

pp. 560-578

BibTeX  Abstract Full Text:  PDF